Some criteria for error bounds in set optimization
نویسندگان
چکیده
We obtain sufficient and/or necessary conditions for global/local error bounds for the distances to some sets appeared in set optimization studied with both the set approach and vector approach (sublevel sets, constraint sets, sets of all Pareto efficient/ Henig proper efficient/super efficient solutions, sets of solutions corresponding to one Pareto efficient/Henig proper efficient/super efficient value) and sufficient conditions for metric subregulatity of a set-valued map at efficient solutions. All criteria except one are described in terms of the Mordukhovich coderivative and coderivative of convex analysis. Our techniques are based on scalarization by mean of the Hiriart-Urruty signed distance function, on exploiting criteria in terms of subdifferentials for error bounds of a lower semicontinuous function and estimates for subdifferentials of marginal functions. We also consider the single-valued case and provide illustrating examples.
منابع مشابه
Lower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملSome lower bounds for the $L$-intersection number of graphs
For a set of non-negative integers~$L$, the $L$-intersection number of a graph is the smallest number~$l$ for which there is an assignment of subsets $A_v subseteq {1,dots, l}$ to vertices $v$, such that every two vertices $u,v$ are adjacent if and only if $|A_u cap A_v|in L$. The bipartite $L$-intersection number is defined similarly when the conditions are considered only for the ver...
متن کاملPSO for multi-objective problems: Criteria for leader selection and uniformity distribution
This paper proposes a method to solve multi-objective problems using improved Particle Swarm Optimization. We propose leader particles which guide other particles inside the problem domain. Two techniques are suggested for selection and deletion of such particles to improve the optimal solutions. The first one is based on the mean of the m optimal particles and the second one is based on appoin...
متن کاملError bounds in approximating n-time differentiable functions of self-adjoint operators in Hilbert spaces via a Taylor's type expansion
On utilizing the spectral representation of selfadjoint operators in Hilbert spaces, some error bounds in approximating $n$-time differentiable functions of selfadjoint operators in Hilbert Spaces via a Taylor's type expansion are given.
متن کاملGlobal Forcing Number for Maximal Matchings under Graph Operations
Let $S= \{e_1,\,e_2, \ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$. The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$, where $d_i=1$ if $e_i\in M$ and $d_i=0$ otherwise, for each $i\in\{1,\ldots , k\}$. We say $S$ is a global forcing set for maximal matchings of $G$ if $...
متن کامل